Fast and deterministic computation of the determinant of a polynomial matrix
نویسندگان
چکیده
Given a square, nonsingular matrix of univariate polynomials F ∈ K[x]n×n over a field K, we give a deterministic algorithm for finding the determinant of F. The complexity of the algorithm is O ̃(nωs) field operations where s is the average column degree or the average row degree of F. Here O ̃ notation is Big-O with log factors omitted and ω is the exponent of matrix multiplication.
منابع مشابه
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Given a nonsingular n × n matrix of univariate polynomials over a field K, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use Õ(nωdse) operations in K, where s is bounded from above by both the average of the degrees of the rows and that of the columns of the matrix and ω is the exponent of matrix multiplication. The soft-O notat...
متن کاملAsymptotically fast polynomial matrix algorithms for multivariable systems
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form [8, 9, 16, 17]. We show that they essentially can be reduced to two computer algebra techniques, minimal basis computations and matrix fraction expansion/reconstruction, and to polynomial matrix multiplication. Such reducti...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.5462 شماره
صفحات -
تاریخ انتشار 2014